A randomized algorithm for long directed cycle
نویسندگان
چکیده
منابع مشابه
A Randomized Algorithm for Long Directed Cycle
Given a directed graph G and a parameter k, the Long Directed Cycle (LDC) problem asks whether G contains a simple cycle on at least k vertices, while the k-Path problems asks whether G contains a simple path on exactly k vertices. Given a deterministic (randomized) algorithm for k-Path as a black box, which runs in time t(G, k), we prove that LDC can be solved in deterministic time O(max{t(G, ...
متن کاملAn Õ(m2n) Randomized Algorithm to Compute a Minimum Cycle Basis of a Directed Graph
We consider the problem of computing a minimum cycle basis in a directed graph G. The input to this problem is a directed graph whose arcs have positive weights. In this problem a 1 0 1 incidence vector is associated with each cycle and the vector space over generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. ...
متن کاملSIMULATED ANNEALING ALGORITHM FOR SELECTING SUBOPTIMAL CYCLE BASIS OF A GRAPH
The cycle basis of a graph arises in a wide range of engineering problems and has a variety of applications. Minimal and optimal cycle bases reduce the time and memory required for most of such applications. One of the important applications of cycle basis in civil engineering is its use in the force method to frame analysis to generate sparse flexibility matrices, which is needed for optimal a...
متن کاملA Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs
We consider the problem of computing a minimum cycle basis in a directed graph G with m arcs and n vertices. The arcs of G have non-negative weights assigned to them. We give an Õ(mn) algorithm, which is the first polynomial time algorithm for this problem. We also present an Õ(mn) randomized algorithm. The problem of computing a minimum cycle basis in an undirected graph has been well-studied....
متن کاملAn O(nm) time algorithm for finding the min length directed cycle in a graph
In this paper, we introduce an O(nm) time algorithm to determine the minimum length directed cycle in a directed network with n nodes and m arcs and with no negative length directed cycles. This result improves upon the previous best time bound of O(nm + n log log n). Our algorithm first determines the cycle with minimum mean length λ∗ in O(nm) time. Subsequently, it chooses node potentials so ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2016
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2016.02.005